Experiments on FPRM Expressions for Partially Symmetric Logic Functions
نویسندگان
چکیده
This paper focuses on the fixed polarity ReedMuller (FPRM) expression of multiple-valued logic (MVL) symmetric functions. In the FPRM expression, each variable occurs in exactly one complemented form. We show properties of the FPRM of partially symmetric functions and report experimental results for certain benchmark functions.
منابع مشابه
The Eigenfunction of the Reed-Muller Transformation
We introduce eigenfunctions of the Reed-Muller transform. Eigenfunctions are functions whose canonical sumof-products expression and PPRM (positive polarity ReedMuller expression) are isomorphic. In the case of symmetric functions, the eigenfunction can be viewed as a function whose reduced truth vector is identical to the reduced ReedMuller spectrum. We show that the number of symmetric (ordin...
متن کاملEfficient Calculation of Fixed-Polarity Polynomial Expressions for Multiple-Valued Logic Functions
This paper presents a tabular technique for calculation of fixed-polarity polynomial expressions for MV functions. The technique is derived from a generalization of the corresponding methods for Fixed-Polarity Reed-Muller (FPRM) expressions for switching functions. All useful features of tabular techniques for FPRMs, as for example, simplicity of involved operations and high possibilities for p...
متن کاملOn the Use of Transeunt Triangles to Synthesize Fixed-Polarity Reed-Muller Expansions of Functions
The transeunt triangle was originally proposed by Suprun [19] as the basis of an algorithm for synthesizing fixed-polarity Reed-Muller (FPRM) expansions of symmetric functions. However, he provided no proof that this technique produced the correct FPRM expansion. We provide such a proof, thus establishing the validity of the transeunt triangle technique. Further, we show the extent to which the...
متن کاملExact Minimization of Fixed Polarity Reed-Muller Expressions for Incompletely Speci ed Functions
This paper presents an exact minimization algorithm for fixed polarity Reed-Muller expressions (FPRMs) for incompletely specified functions. For an n-variable function with unspecified minterms there are 2 distinct FPRMs. A minimum FPRM is one with the fewest products. The minimization algorithm is based on the multi-terminal binary decision diagrams. Experimental results for a set of functions...
متن کاملExact Minimization of FPRMs for Incompletely Specified Functions by Using MTBDDs
Fixed polarity Reed-Muller expressions (FPRMs) exhibit several useful properties that make them suitable for many practical applications. This paper presents an exact minimization algorithm for FPRMs for incompletely specified functions. For an n-variable function with α unspecified minterms there are 2n+α distinct FPRMs, and a minimum FPRM is one with the fewest product terms. To find a minimu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000